Authors’ Reply to the “Comments on the Core Vector Machines: Fast SVM Training on Very Large Data Sets”
نویسندگان
چکیده
In this reply, we report results on using the Windows binary of the CVM on the checkers and other real-world data sets. Experimental results show that the CVM is much more stable than is reported in (Loosli and Canu, 2007). Moreover, the analysis of CVM’s stopping criterion in (Loosli and Canu, 2007) is based on some connections between the traditional ν-SVM and C-SVM using the 1-norm error. However, CVM uses the 2-norm error. A more careful derivation shows that the stopping criterion is not necessarily loose even for large C.
منابع مشابه
Comments on the "Core Vector Machines: Fast SVM Training on Very Large Data Sets"
In a recently published paper in JMLR, Tsang et al. (2005) present an algorithm for SVM called Core Vector Machines (CVM) and illustrate its performances through comparisons with other SVM solvers. After reading the CVM paper we were surprised by some of the reported results. In order to clarify the matter, we decided to reproduce some of the experiments. It turns out that to some extent, our r...
متن کاملSeparating Well Log Data to Train Support Vector Machines for Lithology Prediction in a Heterogeneous Carbonate Reservoir
The prediction of lithology is necessary in all areas of petroleum engineering. This means that to design a project in any branch of petroleum engineering, the lithology must be well known. Support vector machines (SVM’s) use an analytical approach to classification based on statistical learning theory, the principles of structural risk minimization, and empirical risk minimization. In this res...
متن کاملCore Vector Machines: Fast SVM Training on Very Large Data Sets
Standard SVM training has O(m3) time and O(m2) space complexities, where m is the training set size. It is thus computationally infeasible on very large data sets. By observing that practical SVM implementations only approximate the optimal solution by an iterative strategy, we scale up kernel methods by exploiting such “approximateness” in this paper. We first show that many kernel methods can...
متن کاملFace Recognition using Eigenfaces , PCA and Supprot Vector Machines
This paper is based on a combination of the principal component analysis (PCA), eigenface and support vector machines. Using N-fold method and with respect to the value of N, any person’s face images are divided into two sections. As a result, vectors of training features and test features are obtain ed. Classification precision and accuracy was examined with three different types of kernel and...
متن کاملSequential minimal optimization: A fast Algorithm for Training Support Vector machines
This paper proposes a new algorithm for training support vector machines: Sequential Minimal Optimization, or SMO. Training a support vector machine requires the solution of a very large quadratic programming (QP) optimization problem. SMO breaks this large QP problem into a series of smallest possible QP problems. These small QP problems are solved analytically, which avoids using a time-consu...
متن کامل